A note on orthogonal Latin hypercubes
نویسندگان
چکیده
Latin hypercube designs have been found very useful for designing computer experiments. In recent years, several methods of constructing orthogonal Latin hypercube designs have been proposed in the literature. In this article, we report some more results on Latin hypercube designs, including several new designs.
منابع مشابه
A General Construction for Space-filling Latin Hypercubes
Abstract: We propose a general method for constructing Latin hypercubes of flexible run sizes for computer experiments. The method makes use of arrays with a special structure and Latin hypercubes. By using different such arrays and Latin hypercubes, the proposed method produces various types of Latin hypercubes including orthogonal and nearly orthogonal Latin hypercubes, sliced Latin hypercube...
متن کاملOn the Structure of Orthogonal Latin Hypercubes
The structure of orthogonal Latin hypercubes(OLH) is established in vector space over GF(2). An upper bound on the number of columns of an OLH is given. An OLH whose number of columns reaches the upper bound are found for m = 3 and m = 4, while the cases for m 5 are still unknown.
متن کاملConstruction of Orthogonal Nearly Latin Hypercubes
Orthogonal Latin hypercubes (OLHs) are available for only a limited collection of run sizes. This paper presents a simple algorithm for constructing orthogonal designs that are nearly Latin hypercubes. The algorithm is based on the approach developed by Steinberg and Lin for OLH designs and can generate designs for all run sizes for which a Plackett-Burman design exists. The designs have good u...
متن کاملLatin k-hypercubes
We study k dimensional Latin hypercubes of order n. We describe the automorphism groups of the hypercubes and define the parity of a hypercube and relate the parity with the determinant of a permutation hypercube. We determine the parity in the orbits of the automorphism group. Based on this definition of parity we make a conjecture similar to the Alon-Tarsi conjecture. We define an orthogonali...
متن کاملEfficient Nearly Orthogonal and Space-Filling Latin Hypercubes
This article presents an algorithm for constructing orthogonal Latin hypercubes, given a fixed sample size, in more dimensions than previous approaches. In addition, we detail a method that dramatically improves the space-filling properties of the resultant Latin hypercubes at the expense of inducing small correlations between the columns in the design matrix. Although the designs are applicabl...
متن کامل